A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs
نویسندگان
چکیده
We propose a fixed-parameter tractable algorithm for the Max-Cut problem on embedded 1-planar graphs parametrized by the crossing number k of the given embedding. A graph is called 1-planar if it can be drawn in the plane with at most one crossing per edge. Our algorithm recursively reduces a 1-planar graph to at most 3 planar graphs, using edge removal and node contraction. The Max-Cut problem is then solved on the planar graphs using established polynomial-time algorithms. We show that a maximum cut in the given 1-planar graph can be derived from the solutions for the planar graphs. Our algorithm computes a maximum cut in an embedded 1-planar graph with n nodes and k edge crossings in time O(3 · n log n).
منابع مشابه
Min-Max Multiway Cut
We propose the Min-max multiway cut problem, a variant of the traditional Multiway cut problem, but with the goal of minimizing the maximum capacity (rather than the sum or average capacity) leaving a part of the partition. The problem is motivated by data partitioning in Peer-to-Peer networks. The min-max objective function forces the solution not to overload any given terminal, and hence may ...
متن کاملGraphs with no K3,3 Minor Containing a Fixed Edge
It is well known that every cycle of a graph must intersect every cut in an even number of edges. For planar graphs, Ford and Fulkerson proved that, for any edge e, there exists a cycle containing e that intersects every minimal cut containing e in exactly two edges. The main result of this paper generalizes this result to any nonplanar graph G provided G does not have a K 3,3 minor containing ...
متن کاملA Fixed-Parameter Algorithm for Max Edge Domination
In a graph, an edge is said to dominate itself and its adjacent edges. Given an undirected and edge-weighted graph G = (V,E) and an integer k, Max Edge Domination problem (MaxED) is to find a subset K ⊆ E with cardinality at most k such that total weight of edges dominated by K is maximized. MaxED is NP-hard due to the NP-hardness of the minimum edge dominating set problem. In this paper, we pr...
متن کاملA Simple MAX-CUT Algorithm for Planar Graphs
The max-cut problem asks for partitioning the nodes V of a graph G = (V,E) into two sets (one of which might be empty), such that the sum of weights of edges joining nodes in different partitions is maximum. Whereas for general instances the max-cut problem is NPhard, it is polynomially solvable for certain classes of graphs. For planar graphs, there exist several polynomial-time methods determ...
متن کاملImproved Minimum Cuts and Maximum Flows in Undirected Planar Graphs
In this paper we study minimum cut and maximum flow problems on planar graphs, both in static and in dynamic settings. First, we present an algorithm that given an undirected planar graph computes the minimum cut between any two given vertices in O(n log logn) time. Second, we show how to achieve the same O(n log logn) bound for the problem of computing maximum flows in undirected planar graphs...
متن کامل